Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions by Dawn
نویسندگان
چکیده
We give conditions under which a Markov chain constructed via parallel or simulated tempering is guaranteed to be rapidly mixing, which are applicable to a wide range of multimodal distributions arising in Bayesian statistical inference and statistical mechanics. We provide lower bounds on the spectral gaps of parallel and simulated tempering. These bounds imply a single set of sufficient conditions for rapid mixing of both techniques. A direct consequence of our results is rapid mixing of parallel and simulated tempering for several normal mixture models, and for the mean-field Ising model.
منابع مشابه
Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions
We give conditions under which a Markov chain constructed via parallel or simulated tempering is guaranteed to be rapidly mixing, which are applicable to a wide range of multimodal distributions arising in Bayesian statistical inference and statistical mechanics. We provide lower bounds on the spectral gaps of parallel and simulated tempering. These bounds imply a single set of sufficient condi...
متن کاملConditions for Torpid Mixing of Parallel and Simulated Tempering on Multimodal Distributions
We obtain upper bounds on the convergence rates of Markov chains constructed by parallel and simulated tempering. These bounds are used to provide a set of sufficient conditions for torpid mixing of both techniques. We apply these conditions to show torpid mixing of parallel and simulated tempering for three examples: a normal mixture model with unequal covariances in RM and the mean-field Pott...
متن کاملSufficient Conditions for Torpid Mixing of Parallel and Simulated Tempering
We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated tempering, and provide a set of sufficient conditions for torpid mixing of both techniques. Combined with the results of [22], these results yield a two-sided bound on the spectral gap of these algorithms. We identify a persistence property of the target distribution, and show that it can lead unex...
متن کاملSimulated Tempering and Swapping on Mean-Field Models
Simulated and parallel tempering are families of Markov Chain Monte Carlo algorithms where a temperature parameter is varied during the simulation to overcome bottlenecks to convergence due to multimodality. In this work we introduce and analyze the convergence for a set of new tempering distributions which we call entropy dampening. For asymmetric exponential distributions and the mean field I...
متن کاملSampling from multimodal distributions using tempered transitions
I present a new Markov chain sampling method appropriate for distributions with isolated modes. Like the recently-developed method of \simulated tempering", the \tempered transition" method uses a series of distributions that interpolate between the distribution of interest and a distribution for which sampling is easier. The new method has the advantage that it does not require approximate val...
متن کامل